Ray Solomonoff (1926-2009)

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ray Solomonoff, Founding Father of Algorithmic Information Theory

in Cambridge, Massachusetts, of complications of a stroke caused by an aneurism in his head. Ray was the first inventor of Algorithmic Information Theory which deals with the shortest effective description length of objects and is commonly designated by the term " Kolmogorov complexity. " In the 1950s Solomonoff was one of the first researchers to treat probabilistic grammars and the associated...

متن کامل

Solomonoff Induction

Solomonoff's induction method is an interesting theoretical model of what could be considered a perfect inductive inference system. Furthermore, it can be proven that a whole range of commonly used induction principles are computable approximations or special cases of Solomonoff's method. As such, Solomonoff induction provides us with a powerful and unifying perspective on the many diverse prin...

متن کامل

The Great Ray Solomonoff, pioneer of Machine Learning, founder of Algorithmic Probability

Satisfiability (SAT) testing methods have been usedeffectively in many inference, planning and constraintsatisfaction tasks and thus have been considered acontribution towards artificial general intelligence.However, since SAT constraints are defined over atomicpropositions, domains with state variables that change overtime can lead to extremely large search spaces. This...

متن کامل

Solomonoff Induction Violates Nicod's Criterion

Nicod’s criterion states that observing a black raven is evidence for the hypothesis H that all ravens are black. We show that Solomonoff induction does not satisfy Nicod’s criterion: there are time steps in which observing black ravens decreases the belief in H. Moreover, while observing any computable infinite string compatible with H, the belief in H decreases infinitely often when using the...

متن کامل

Solomonoff Prediction and Occam’s Razor

Algorithmic information theory gives an idealized notion of compressibility, that is often presented as an objective measure of simplicity. It is suggested at times that Solomonoff prediction, or algorithmic information theory in a predictive setting, can deliver an argument to justify Occam’s razor. This paper explicates the relevant argument, and, by converting it into a Bayesian framework, r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algorithms

سال: 2010

ISSN: 1999-4893

DOI: 10.3390/a30302555